Extended Linial Hyperplane Arrangements for Root Systems and a Conjecture of Postnikov and Stanley
نویسنده
چکیده
A hyperplane arrangement is said to satisfy the “Riemann hypothesis” if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which are defined for any irreducible root system and was proved for the root system An−1. The proof is based on an explicit formula [1, 2, 11] for the characteristic polynomial, which is of independent combinatorial significance. Here our previous derivation of this formula is simplified and extended to similar formulae for all but the exceptional root systems. The conjecture follows in these cases.
منابع مشابه
Deformations of Coxeter Hyperplane Arrangements
We investigate several hyperplane arrangements that can be viewed as deformations of Coxeter arrangements. In particular, we prove a conjecture of Linial and Stanley that the number of regions of the arrangement xi − xj = 1, 1 ≤ i < j ≤ n, is equal to the number of alternating trees on n + 1 vertices. Remarkably, these numbers have several additional combinatorial interpretations in terms of bi...
متن کاملEnumeration in Algebra and Geometry
This thesis is devoted to solution of two classes of enumerative problems. The first class is related to enumeration of regions of hyperplane arrangements. We investigate deformations of Coxeter arrangements. In particular, we prove a conjecture of Stanley on the numbers of regions of Linial arrangements. These numbers have several additional combinatorial interpretations in terms of trees, par...
متن کاملAlgebraic Combinatorics of Graph Spectra , Subspace Arrangements and Tutte Polynomials by Christos A . Athanasiadis
The present thesis consists of three independent parts. In the first part we employ an elementary counting method to study the eigenvalues of the adjacency matrices of some special families of graphs. The main example is provided by the directed graph D(G), constructed by Propp on the vertex set of oriented spanning rooted trees of a given directed graph G. We describe the eigenvalues of D(G) i...
متن کاملHyperplane arrangements, interval orders, and trees.
A hyperplane arrangement is a finite set of hyperplanes in a real affine space. An especially important arrangement is the braid arrangement, which is the set of all hyperplanes xi - xj = 1, 1 </= i < j </= n, in Rn. Some combinatorial properties of certain deformations of the braid arrangement are surveyed. In particular, there are unexpected connections with the theory of interval orders and ...
متن کاملFrom Bruhat intervals to intersection lattices and a conjecture of Postnikov
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation w ∈ Sn is at most the number of elements below w in the Bruhat order, and (B) that equality holds if and only if w avoids the patterns 4231, 35142, 42513 and 351624. Furthermore, assertion (A) is extended to all finite reflection groups. A byproduct of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997